A Heuristic Incremental Modeling Approach to Course Timetabling
نویسندگان
چکیده
The general timetabling problem is an assignment of activ ities to xed time intervals adhering to a prede ned set of resource availabilities Timetabling problems are di cult to solve and can be ex tremely time consuming without some computer assistance In this paper the application of constraint based reasoning to timetable generation is examined Speci cally we consider how a timetabling problem can be represented as a Constraint Satisfaction Problem CSP and propose an algorithm for its solution which improves upon the basic idea of back tracking Normally when a backtracking routine fails to nd a solution there is nothing of value returned to the user however our algorithm extends this process by iteratively adding constraints to the CSP repre sentation A generalized random model of timetabling problems is pro posed This model creates a diverse range of problem instances which are used to verify our search algorithm and identify the characteristics of di cult timetabling problems
منابع مشابه
A Memetic Algorithm for Solving a Timetabling Problem: An Incremental Strategy
Timetabling problems are well known complicated constraint satisfaction problems. A new realworld course timetabling problem is described in this study. The difficulty in approximating to an optimal solution in a reasonable time increases for the large problem instances regardless of the algorithm used. An incremental strategy that aims to relieve this difficulty to some extent combined with a ...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملAn Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems
The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex ...
متن کاملA graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملExperimental Result of Particle Collision Algorithm for Solving Course Timetabling Problems
This work presents a Particle Collision Algorithm (PCA) to solve university course timetabling problems. The aim is to produce an effective algorithm for assigning a set of courses, lecturers and students to a specific number of rooms and timeslots, subject to a set of constraints. PCA approach that was originally introduced by Sacco for policy optimization. PCA always accepts improved solution...
متن کامل